#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
void testLoad();
void testLongLong()
{
    unsigned long long ll = -1;
    printf("%llu\n", ll);
    cout << sizeof(long long) << endl;
}
void testFlattenOut();

struct A
{
    A(){}
    ~A(){}
    int m1;
    int m2;
}a;
struct B
{
    B(){}
    ~B(){}
    int m1;
    char m2;
    static char m3;
}b;
struct C
{
    C(){}
    virtual ~C();
    virtual void test(){}
    int m1;
    int m2;
};
extern int test(){}
static int test1(){}
const int test2(){}
extern int testvar;
static int testvar1;
const int testvar2 = 1;
int comp(const void *a, const void *b){
    return *(int*)a - *(int*)b;
}
int main()
{
    //testLoad();
    //testLongLong();
    //testFlattenOut();
    //cout << "a:" << sizeof(a) << " b:" << sizeof(b) << " c:" << sizeof(C)<<endl;
    int p[] = {3,54,2,23,45};
    qsort(p, sizeof(p)/sizeof(int), sizeof(int),comp);
    for (int a: p) cout << a << " ";
    return 0;
}
